LIMIT lliEOREMS FOR AN EXTENDED COUPON COLLECTOR ' S PROBLEM AND FOR SUCCESSIVE SUBSAMPLING WIlli VARYING PROBABILITIES
نویسنده
چکیده
Asymptotic normality as well as some weak invariance principles for bonus sums and waiting times in an extended coupon collector's problem are considered and incorporated in the study of the asymptotic distribution theory of estimators of (finite) population totals in successive sub-sampling (or multistage sampling) with varying probabilities (without replacements). Some applications of these theorems are also considered.
منابع مشابه
Some upper and lower bounds on the coupon collector problem
The classical coupon collector problem is closely related to probabilistic-packet-marking (PPM) schemes for IP traceback problem in the Internet. In this paper, we study the classical coupon collector problem, and derive some upper and lower bounds of the complementary cumulative distribution function (ccdf) of the number of objects (coupons) that one has to check in order to detect a set of di...
متن کاملContributions to the Generalized Coupon Collector and LRU Problems
Based upon inequalities on Subset Probabilities, proofs of several conjectures on the Generalized Coupon Collector Problem (i.e. CCP with unequal popularity) are presented. Then we derive a very simple asymptotic relation between the expectation of the waiting time for a partial collection in the CCP, and the Miss rate of a LRU cache.
متن کاملThe Generalized Coupon Collector Problem
Coupons are collected one at a time from a population containing n distinct types of coupon. The process is repeated until all n coupon have been collected and the total number of draws, Y , from the population is recorded. It is assumed that the draws from the population are independent and identically distributed (draws with replacement) according to a probability distribution X with the prob...
متن کاملThe Generalised Coupon Collector Problem
Coupons are collected one at a time from a population containing n distinct types of coupon. The process is repeated until all n coupons have been collected and the total number of draws, Y , from the population is recorded. It is assumed that the draws from the population are independent and identically distributed (draws with replacement) according to a probability distributionXwith the proba...
متن کاملThe Coupon-collector Problem Revisited — a Survey of Engineering Problems and Computational Methods
A standard combinatorial problem is to estimate the number (T ) of coupons, drawn at random, needed to complete a collection of all possible m types. Generalizations of this problem have found many engineering applications. The usefulness of the model is hampered by the difficulties in obtaining numerical results for moments or distributions. We show two computational paradigms that are well su...
متن کامل